#include<bits/stdc++.h>
#define ll long long
#define int ll
#define L x<<1
#define R L|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(ll x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N =5e5+5,M=1.1e6+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,a[N];double f[N][2];
double sq[N]; 
inline double w(int l,int r){
	return (double)a[l]+sq[r-l]-a[r];
}
bool fl=1;
inline void solve(int l,int r,int Ll,int Rr){
	if(l>r||Ll>Rr)return;
	int ans=Ll;
	rep(i,Ll,min(Rr,mid)){
		if(w(i,mid)>w(ans,mid))ans=i;
	}
	f[mid][fl]=w(ans,mid);
	solve(l,mid-1,Ll,ans),solve(mid+1,r,ans,Rr);
}
inline void Main(){
	n=read();
	repn(i)a[i]=read(),sq[i]=sqrt(i);
	solve(1,n,1,n);
	fl=0;
	rep(i,1,n/2)swap(a[i],a[n-i+1]);
	solve(1,n,1,n);
	repn(i)cout <<(int)ceil(max(f[i][1],f[n-i+1][0]))<<'\n';
	//max(a[j]+sqrt(i-j))-a[i]
}
signed main(){
	int T=1;
	while(T--)Main(); 
	return 0;
}
